2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs

نویسنده

  • Sagnik Sen
چکیده

In this paper, we improve the existing bounds [2] for 2-dipath and oriented L(2, 1) span for the class of planar graphs with girth 5, 11, 16, cactus, wheels and leaf independent Halin graphs. Some of these bounds are tight.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

L(2, 1)-labelings of Some Families of Oriented Planar Graphs

In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.

متن کامل

L(2, 1)-labelings of some famillies of oriented planar graphs

In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.

متن کامل

Bounds for the (m,n)-mixed chromatic number and the oriented chromatic number

A bound for the (n,m)-mixed chromatic number in terms of the chromatic number of the square of the underlying undirected graph is given. A similar bound holds when the chromatic number of the square is replaced by the injective chromatic number. When restricted to n = 1 andm = 0 (i.e., oriented graphs) this gives a new bound for the oriented chromatic number. In this case, a slightly improved b...

متن کامل

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

متن کامل

L(2, 1)-Labeling of Oriented Planar Graphs

In this paper we study the L(2, 1)-labeling problem on oriented planar graphs with particular attention on the subclasses of oriented prisms, Halin and cactus graphs. For these subclasses more accurate results are presented. keywords: L(2, 1)-labeling, oriented graph coloring, digraphs, prisms, Halin graphs, cacti.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2011